<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OpenMesh: OpenMesh/Tools/Utils/HeapT.hh Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="logo_align.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="rwth_vci_rgb.jpg"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">OpenMesh
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('a00734_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">HeapT.hh</div>  </div>
</div><!--header-->
<div class="contents">
<a href="a00734.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/* ========================================================================= *</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *                               OpenMesh                                    *</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> *           Copyright (c) 2001-2015, RWTH-Aachen University                 *</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> *           Department of Computer Graphics and Multimedia                  *</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> *                          All rights reserved.                             *</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> *                            www.openmesh.org                               *</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> *---------------------------------------------------------------------------*</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * This file is part of OpenMesh.                                            *</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> *---------------------------------------------------------------------------*</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> * Redistribution and use in source and binary forms, with or without        *</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * modification, are permitted provided that the following conditions        *</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * are met:                                                                  *</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * 1. Redistributions of source code must retain the above copyright notice, *</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> *    this list of conditions and the following disclaimer.                  *</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright      *</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment"> *    notice, this list of conditions and the following disclaimer in the    *</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment"> *    documentation and/or other materials provided with the distribution.   *</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment"> * 3. Neither the name of the copyright holder nor the names of its          *</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"> *    contributors may be used to endorse or promote products derived from   *</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *    this software without specific prior written permission.               *</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS       *</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment"> * &quot;AS IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment"> * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A           *</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment"> * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="comment"> * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,  *</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment"> * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,       *</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment"> * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR        *</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment"> * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF    *</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment"> * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING      *</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment"> * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS        *</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment"> * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.              *</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment"> *                                                                           *</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment"> * ========================================================================= */</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="comment">//=============================================================================</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="comment">//  CLASS HeapT</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="comment">//=============================================================================</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="preprocessor">#ifndef OPENMESH_UTILS_HEAPT_HH</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="preprocessor">#define OPENMESH_UTILS_HEAPT_HH</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;<span class="comment">//== INCLUDES =================================================================</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="a04467.html">Config.hh</a>&quot;</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00437.html">OpenMesh/Core/System/omstream.hh</a>&gt;</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="preprocessor">#if (defined(_MSC_VER) &amp;&amp; (_MSC_VER &gt;= 1800)) || __cplusplus &gt; 199711L || defined(__GXX_EXPERIMENTAL_CXX0X__)</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="comment">//== NAMESPACE ================================================================</span></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keyword">namespace </span><a class="code" href="a01233.html">OpenMesh</a> { <span class="comment">// BEGIN_NS_OPENMESH</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="keyword">namespace </span>Utils { <span class="comment">// BEGIN_NS_UTILS</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="comment">//== CLASS DEFINITION =========================================================</span></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> HeapEntry&gt;</div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="a03069.html">   98</a></span>&#160;<span class="keyword">struct </span><a class="code" href="a03069.html">HeapInterfaceT</a></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;{</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;  <span class="keywordtype">bool</span> <a class="code" href="a03069.html#ae246f6c4f57df712acd35b0288e29aff">less</a>(<span class="keyword">const</span> HeapEntry&amp; _e1, <span class="keyword">const</span> HeapEntry&amp; _e2);</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;  <span class="keywordtype">bool</span> <a class="code" href="a03069.html#a86ba29c86c9189b6394fb154932b52e7">greater</a>(<span class="keyword">const</span> HeapEntry&amp; _e1, <span class="keyword">const</span> HeapEntry&amp; _e2);</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;  <span class="keywordtype">int</span>  <a class="code" href="a03069.html#a21d249ef7e9a185e92d2774f9fe43616">get_heap_position</a>(<span class="keyword">const</span> HeapEntry&amp; _e);</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03069.html#adcce753277a5a14d36b038b412a9de6c">set_heap_position</a>(HeapEntry&amp; _e, <span class="keywordtype">int</span> _i);</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;};</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> HeapEntry, <span class="keyword">class</span> HeapInterface=HeapEntry&gt;</div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="a03073.html">  138</a></span>&#160;<span class="keyword">class </span><a class="code" href="a03073.html">HeapT</a> : <span class="keyword">private</span> std::vector&lt;HeapEntry&gt;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;{</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="keyword">private</span>: </div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;  <span class="keyword">typedef</span> std::vector&lt;HeapEntry&gt;            Base;</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;  </div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;</div><div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="a03073.html#a24a2c62d488a9a9e73572ad7820a8e68">  146</a></span>&#160;  <a class="code" href="a03073.html#a24a2c62d488a9a9e73572ad7820a8e68">HeapT</a>() : HeapVector() {}</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;  </div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;<span class="preprocessor">#if (defined(_MSC_VER) &amp;&amp; (_MSC_VER &gt;= 1800)) || __cplusplus &gt; 199711L || defined(__GXX_EXPERIMENTAL_CXX0X__)</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;  <a class="code" href="a03073.html">HeapT</a>(HeapInterface _interface)</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;  : HeapVector(),  interface_(std::move(_interface))</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;  {}</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;  <span class="keyword">explicit</span> <a class="code" href="a03073.html">HeapT</a>(<span class="keyword">const</span> HeapInterface &amp;_interface)</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;  : HeapVector(),  interface_(_interface)</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;  {}</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;</div><div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="a03073.html#a7e0a462d94cdd0c68aeeaaeadfa78d2d">  161</a></span>&#160;  <a class="code" href="a03073.html#a7e0a462d94cdd0c68aeeaaeadfa78d2d">~HeapT</a>(){};</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;  HeapInterface &amp;getInterface() {</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;      <span class="keywordflow">return</span> interface_;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;  }</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;  <span class="keyword">const</span> HeapInterface &amp;getInterface()<span class="keyword"> const </span>{</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;      <span class="keywordflow">return</span> interface_;</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;  }</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;</div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="a03073.html#afef1992d5a553b9e8d152af61b9e4fc2">  172</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03073.html#afef1992d5a553b9e8d152af61b9e4fc2">clear</a>() { HeapVector::clear(); }</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="a03073.html#a536a85f292f05b98593afbb682e54471">  175</a></span>&#160;  <span class="keywordtype">bool</span> <a class="code" href="a03073.html#a536a85f292f05b98593afbb682e54471">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> HeapVector::empty(); }</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;</div><div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="a03073.html#a2c81430f8b72e3aae305b025d83c3307">  178</a></span>&#160;  <span class="keywordtype">size_t</span> <a class="code" href="a03073.html#a2c81430f8b72e3aae305b025d83c3307">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> HeapVector::size(); }</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;</div><div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="a03073.html#ab25df952eaf2a9195243759dab1c252e">  181</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03073.html#ab25df952eaf2a9195243759dab1c252e">reserve</a>(<span class="keywordtype">size_t</span> _n) { HeapVector::reserve(_n); }</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;</div><div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="a03073.html#a35feb375cbcf48457e8e2d6307fe7fba">  184</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03073.html#a35feb375cbcf48457e8e2d6307fe7fba">reset_heap_position</a>(HeapEntry _h)</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;  { interface_.set_heap_position(_h, -1); }</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;  </div><div class="line"><a name="l00188"></a><span class="lineno"><a class="line" href="a03073.html#af286643ed54c1f7252989b2a525c0c07">  188</a></span>&#160;  <span class="keywordtype">bool</span> <a class="code" href="a03073.html#af286643ed54c1f7252989b2a525c0c07">is_stored</a>(HeapEntry _h)</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;  { <span class="keywordflow">return</span> interface_.get_heap_position(_h) != -1; }</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;  </div><div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="a03073.html#a986a09f8eef49ee033663b59fa068c22">  192</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03073.html#a986a09f8eef49ee033663b59fa068c22">insert</a>(HeapEntry _h)  </div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;  { </div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;    this-&gt;push_back(_h); </div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;    upheap(size()-1); </div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;  }</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div><div class="line"><a name="l00199"></a><span class="lineno"><a class="line" href="a03073.html#a9a19c24235081b7e5fcdbc1ee59453c3">  199</a></span>&#160;  HeapEntry <a class="code" href="a03073.html#a9a19c24235081b7e5fcdbc1ee59453c3">front</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="keyword">  </span>{ </div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;    assert(!empty()); </div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;    <span class="keywordflow">return</span> HeapVector::front();</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;  }</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;</div><div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="a03073.html#aa0f851857c3aee86ea1eb763a5980660">  206</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03073.html#aa0f851857c3aee86ea1eb763a5980660">pop_front</a>()</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;  {    </div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;    assert(!empty());</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;    reset_heap_position(HeapVector::front());</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;    <span class="keywordflow">if</span> (size() &gt; 1)</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;    {</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;      entry(0, entry(size()-1));</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;      Base::pop_back();</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;      downheap(0);</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    }</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;    <span class="keywordflow">else</span></div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;    {</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;      Base::pop_back();</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;    }</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;  }</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;</div><div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="a03073.html#ac141346bca01e86f1f7d9e4f0f2a9d8c">  223</a></span>&#160;  <span class="keywordtype">void</span> <span class="keyword">remove</span>(HeapEntry _h)</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;  {</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;    <span class="keywordtype">int</span> pos = interface_.get_heap_position(_h);</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;    reset_heap_position(_h);</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    assert(pos != -1);</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;    assert((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) pos &lt; size());</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;    </div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;    <span class="comment">// last item ?</span></div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;    <span class="keywordflow">if</span> ((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) pos == size()-1)</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    {</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;      Base::pop_back();    </div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    }</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;    <span class="keywordflow">else</span> </div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    {</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;      entry(pos, entry(size()-1)); <span class="comment">// move last elem to pos</span></div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;      Base::pop_back();</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;      downheap(pos);</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;      upheap(pos);</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;    }</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;  }</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;</div><div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="a03073.html#a5a4198bf734a87481ee5fedc46f2eebd">  248</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="a03073.html#a5a4198bf734a87481ee5fedc46f2eebd">update</a>(HeapEntry _h)</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;  {</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;    <span class="keywordtype">int</span> pos = interface_.get_heap_position(_h);</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;    assert(pos != -1);</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;    assert((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)pos &lt; size());</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;    downheap(pos);</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;    upheap(pos);</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;  }</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;  </div><div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="a03073.html#a3acd94c1497f8b6afd9548ffd64e2318">  258</a></span>&#160;  <span class="keywordtype">bool</span> <a class="code" href="a03073.html#a3acd94c1497f8b6afd9548ffd64e2318">check</a>()</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;  {</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;    <span class="keywordtype">bool</span> ok(<span class="keyword">true</span>);</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i&lt;size(); ++i)</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;    {</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;      <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j;</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;      <span class="keywordflow">if</span> (((j=left(i))&lt;size()) &amp;&amp; interface_.greater(entry(i), entry(j))) </div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;      {</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        omerr() &lt;&lt; <span class="stringliteral">&quot;Heap condition violated\n&quot;</span>;</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        ok=<span class="keyword">false</span>;</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;      }</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;      <span class="keywordflow">if</span> (((j=right(i))&lt;size()) &amp;&amp; interface_.greater(entry(i), entry(j)))</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;      {</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;        omerr() &lt;&lt; <span class="stringliteral">&quot;Heap condition violated\n&quot;</span>;</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        ok=<span class="keyword">false</span>;</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;      }</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;    }</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;    <span class="keywordflow">return</span> ok;</div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;  }</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;<span class="keyword">protected</span>:  </div><div class="line"><a name="l00280"></a><span class="lineno"><a class="line" href="a03073.html#afb629f999cdff18c71780372ffa4a655">  280</a></span>&#160;  HeapInterface <a class="code" href="a03073.html#afb629f999cdff18c71780372ffa4a655">interface_</a>;</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;  <span class="comment">// typedef</span></div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;  <span class="keyword">typedef</span> std::vector&lt;HeapEntry&gt; HeapVector;</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;  </div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;  <span class="keywordtype">void</span> upheap(<span class="keywordtype">size_t</span> _idx);</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;  </div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;  <span class="keywordtype">void</span> downheap(<span class="keywordtype">size_t</span> _idx);</div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;  </div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;  <span class="keyword">inline</span> HeapEntry entry(<span class="keywordtype">size_t</span> _idx)<span class="keyword"> const</span></div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="keyword">  </span>{</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;    assert(_idx &lt; size());</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;    <span class="keywordflow">return</span> (Base::operator[](_idx));</div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;  }</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;  </div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">void</span> entry(<span class="keywordtype">size_t</span> _idx, HeapEntry _h)</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;  {</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;    assert(_idx &lt; size());</div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;    Base::operator[](_idx) = _h;</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;    interface_.set_heap_position(_h, <span class="keywordtype">int</span>(_idx));</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;  }</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;  </div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> parent(<span class="keywordtype">size_t</span> _i) { <span class="keywordflow">return</span> (_i-1)&gt;&gt;1; }</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> left(<span class="keywordtype">size_t</span> _i)   { <span class="keywordflow">return</span> (_i&lt;&lt;1)+1; }</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> right(<span class="keywordtype">size_t</span> _i)  { <span class="keywordflow">return</span> (_i&lt;&lt;1)+2; }</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;};</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;</div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;</div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;<span class="comment">//== IMPLEMENTATION ========================================================== </span></div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;</div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> HeapEntry, <span class="keyword">class</span> HeapInterface&gt;</div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;<span class="keywordtype">void</span></div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;<a class="code" href="a03073.html">HeapT&lt;HeapEntry, HeapInterface&gt;::</a></div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;<a class="code" href="a03073.html">upheap</a>(<span class="keywordtype">size_t</span> _idx)</div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;{</div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;  HeapEntry     h = entry(_idx);</div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;  <span class="keywordtype">size_t</span>        parentIdx;</div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;</div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;  <span class="keywordflow">while</span> ((_idx&gt;0) &amp;&amp; interface_.less(h, entry(parentIdx=parent(_idx))))</div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;  {</div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;    entry(_idx, entry(parentIdx));</div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;    _idx = parentIdx;    </div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;  }</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;  </div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;  entry(_idx, h);</div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;}</div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;  </div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;<span class="comment">//-----------------------------------------------------------------------------</span></div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;</div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;  </div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> HeapEntry, <span class="keyword">class</span> HeapInterface&gt;</div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;<span class="keywordtype">void</span></div><div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;<a class="code" href="a03073.html">HeapT&lt;HeapEntry, HeapInterface&gt;::</a></div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;<a class="code" href="a03073.html">downheap</a>(<span class="keywordtype">size_t</span> _idx)</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;{</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;  <span class="keyword">const</span> HeapEntry     h = entry(_idx);</div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">size_t</span>        s = size();</div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;  </div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;  <span class="keywordflow">while</span>(_idx &lt; s)</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;  {</div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;    <span class="keywordtype">size_t</span> childIdx = left(_idx);</div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;    <span class="keywordflow">if</span> (childIdx &gt;= s) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;    </div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;    <span class="keywordflow">if</span> ((childIdx + 1 &lt; s) &amp;&amp; (interface_.less(entry(childIdx + 1), entry(childIdx))))</div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;      ++childIdx;</div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;    </div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;    <span class="keywordflow">if</span> (interface_.less(h, entry(childIdx))) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;</div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;    entry(_idx, entry(childIdx));</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;    _idx = childIdx;</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;  }  </div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;</div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;  entry(_idx, h);</div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;}</div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;</div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;</div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;<span class="comment">//=============================================================================</span></div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;} <span class="comment">// END_NS_UTILS</span></div><div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;} <span class="comment">// END_NS_OPENMESH</span></div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="comment">//=============================================================================</span></div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;<span class="preprocessor">#endif // OSG_HEAP_HH defined</span></div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;<span class="comment">//=============================================================================</span></div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;</div><div class="ttc" id="a03073_html"><div class="ttname"><a href="a03073.html">OpenMesh::Utils::HeapT</a></div><div class="ttdoc">An efficient, highly customizable heap. </div><div class="ttdef"><b>Definition:</b> HeapT.hh:138</div></div>
<div class="ttc" id="a03073_html_a7e0a462d94cdd0c68aeeaaeadfa78d2d"><div class="ttname"><a href="a03073.html#a7e0a462d94cdd0c68aeeaaeadfa78d2d">OpenMesh::Utils::HeapT::~HeapT</a></div><div class="ttdeci">~HeapT()</div><div class="ttdoc">Destructor. </div><div class="ttdef"><b>Definition:</b> HeapT.hh:161</div></div>
<div class="ttc" id="a03073_html_a24a2c62d488a9a9e73572ad7820a8e68"><div class="ttname"><a href="a03073.html#a24a2c62d488a9a9e73572ad7820a8e68">OpenMesh::Utils::HeapT::HeapT</a></div><div class="ttdeci">HeapT()</div><div class="ttdoc">Constructor. </div><div class="ttdef"><b>Definition:</b> HeapT.hh:146</div></div>
<div class="ttc" id="a04467_html"><div class="ttname"><a href="a04467.html">Config.hh</a></div></div>
<div class="ttc" id="a03073_html_a986a09f8eef49ee033663b59fa068c22"><div class="ttname"><a href="a03073.html#a986a09f8eef49ee033663b59fa068c22">OpenMesh::Utils::HeapT::insert</a></div><div class="ttdeci">void insert(HeapEntry _h)</div><div class="ttdoc">insert the entry _h </div><div class="ttdef"><b>Definition:</b> HeapT.hh:192</div></div>
<div class="ttc" id="a03069_html_a21d249ef7e9a185e92d2774f9fe43616"><div class="ttname"><a href="a03069.html#a21d249ef7e9a185e92d2774f9fe43616">OpenMesh::Utils::HeapInterfaceT::get_heap_position</a></div><div class="ttdeci">int get_heap_position(const HeapEntry &amp;_e)</div><div class="ttdoc">Get the heap position of HeapEntry _e. </div></div>
<div class="ttc" id="a03073_html_a536a85f292f05b98593afbb682e54471"><div class="ttname"><a href="a03073.html#a536a85f292f05b98593afbb682e54471">OpenMesh::Utils::HeapT::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">is heap empty? </div><div class="ttdef"><b>Definition:</b> HeapT.hh:175</div></div>
<div class="ttc" id="a03069_html_ae246f6c4f57df712acd35b0288e29aff"><div class="ttname"><a href="a03069.html#ae246f6c4f57df712acd35b0288e29aff">OpenMesh::Utils::HeapInterfaceT::less</a></div><div class="ttdeci">bool less(const HeapEntry &amp;_e1, const HeapEntry &amp;_e2)</div><div class="ttdoc">Comparison of two HeapEntry&amp;#39;s: strict less. </div></div>
<div class="ttc" id="a03073_html_ab25df952eaf2a9195243759dab1c252e"><div class="ttname"><a href="a03073.html#ab25df952eaf2a9195243759dab1c252e">OpenMesh::Utils::HeapT::reserve</a></div><div class="ttdeci">void reserve(size_t _n)</div><div class="ttdoc">reserve space for _n entries </div><div class="ttdef"><b>Definition:</b> HeapT.hh:181</div></div>
<div class="ttc" id="a03073_html_aa0f851857c3aee86ea1eb763a5980660"><div class="ttname"><a href="a03073.html#aa0f851857c3aee86ea1eb763a5980660">OpenMesh::Utils::HeapT::pop_front</a></div><div class="ttdeci">void pop_front()</div><div class="ttdoc">delete the first entry </div><div class="ttdef"><b>Definition:</b> HeapT.hh:206</div></div>
<div class="ttc" id="a03073_html_a9a19c24235081b7e5fcdbc1ee59453c3"><div class="ttname"><a href="a03073.html#a9a19c24235081b7e5fcdbc1ee59453c3">OpenMesh::Utils::HeapT::front</a></div><div class="ttdeci">HeapEntry front() const</div><div class="ttdoc">get the first entry </div><div class="ttdef"><b>Definition:</b> HeapT.hh:199</div></div>
<div class="ttc" id="a03069_html_a86ba29c86c9189b6394fb154932b52e7"><div class="ttname"><a href="a03069.html#a86ba29c86c9189b6394fb154932b52e7">OpenMesh::Utils::HeapInterfaceT::greater</a></div><div class="ttdeci">bool greater(const HeapEntry &amp;_e1, const HeapEntry &amp;_e2)</div><div class="ttdoc">Comparison of two HeapEntry&amp;#39;s: strict greater. </div></div>
<div class="ttc" id="a00437_html"><div class="ttname"><a href="a00437.html">omstream.hh</a></div><div class="ttdoc">This file provides the streams omlog, omout, and omerr. </div></div>
<div class="ttc" id="a03069_html_adcce753277a5a14d36b038b412a9de6c"><div class="ttname"><a href="a03069.html#adcce753277a5a14d36b038b412a9de6c">OpenMesh::Utils::HeapInterfaceT::set_heap_position</a></div><div class="ttdeci">void set_heap_position(HeapEntry &amp;_e, int _i)</div><div class="ttdoc">Set the heap position of HeapEntry _e. </div></div>
<div class="ttc" id="a03073_html_a5a4198bf734a87481ee5fedc46f2eebd"><div class="ttname"><a href="a03073.html#a5a4198bf734a87481ee5fedc46f2eebd">OpenMesh::Utils::HeapT::update</a></div><div class="ttdeci">void update(HeapEntry _h)</div><div class="ttdoc">update an entry: change the key and update the position to reestablish the heap property. </div><div class="ttdef"><b>Definition:</b> HeapT.hh:248</div></div>
<div class="ttc" id="a03073_html_af286643ed54c1f7252989b2a525c0c07"><div class="ttname"><a href="a03073.html#af286643ed54c1f7252989b2a525c0c07">OpenMesh::Utils::HeapT::is_stored</a></div><div class="ttdeci">bool is_stored(HeapEntry _h)</div><div class="ttdoc">is an entry in the heap? </div><div class="ttdef"><b>Definition:</b> HeapT.hh:188</div></div>
<div class="ttc" id="a03073_html_a3acd94c1497f8b6afd9548ffd64e2318"><div class="ttname"><a href="a03073.html#a3acd94c1497f8b6afd9548ffd64e2318">OpenMesh::Utils::HeapT::check</a></div><div class="ttdeci">bool check()</div><div class="ttdoc">check heap condition </div><div class="ttdef"><b>Definition:</b> HeapT.hh:258</div></div>
<div class="ttc" id="a03069_html"><div class="ttname"><a href="a03069.html">OpenMesh::Utils::HeapInterfaceT</a></div><div class="ttdoc">This class demonstrates the HeapInterface&amp;#39;s interface. </div><div class="ttdef"><b>Definition:</b> HeapT.hh:98</div></div>
<div class="ttc" id="a03073_html_afef1992d5a553b9e8d152af61b9e4fc2"><div class="ttname"><a href="a03073.html#afef1992d5a553b9e8d152af61b9e4fc2">OpenMesh::Utils::HeapT::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">clear the heap </div><div class="ttdef"><b>Definition:</b> HeapT.hh:172</div></div>
<div class="ttc" id="a03073_html_a35feb375cbcf48457e8e2d6307fe7fba"><div class="ttname"><a href="a03073.html#a35feb375cbcf48457e8e2d6307fe7fba">OpenMesh::Utils::HeapT::reset_heap_position</a></div><div class="ttdeci">void reset_heap_position(HeapEntry _h)</div><div class="ttdoc">reset heap position to -1 (not in heap) </div><div class="ttdef"><b>Definition:</b> HeapT.hh:184</div></div>
<div class="ttc" id="a01233_html"><div class="ttname"><a href="a01233.html">OpenMesh</a></div><div class="ttdoc">Contains all the mesh ingredients like the polygonal mesh, the triangle mesh, different mesh kernels ...</div><div class="ttdef"><b>Definition:</b> MeshItems.hh:59</div></div>
<div class="ttc" id="a03073_html_a2c81430f8b72e3aae305b025d83c3307"><div class="ttname"><a href="a03073.html#a2c81430f8b72e3aae305b025d83c3307">OpenMesh::Utils::HeapT::size</a></div><div class="ttdeci">size_t size() const</div><div class="ttdoc">returns the size of heap </div><div class="ttdef"><b>Definition:</b> HeapT.hh:178</div></div>
<div class="ttc" id="a03073_html_afb629f999cdff18c71780372ffa4a655"><div class="ttname"><a href="a03073.html#afb629f999cdff18c71780372ffa4a655">OpenMesh::Utils::HeapT::interface_</a></div><div class="ttdeci">HeapInterface interface_</div><div class="ttdoc">Instance of HeapInterface. </div><div class="ttdef"><b>Definition:</b> HeapT.hh:280</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<hr>
<address>
<small>
<a href="http://www.rwth-graphics.de" style="text-decoration:none;">
</a>
Project <b>OpenMesh</b>, 
&copy;&nbsp; Computer Graphics Group, RWTH Aachen.
Documentation generated using 
<a class="el" href="http://www.doxygen.org/index.html">
<b>doxygen</b>
</a>.
</small>
</address>
</body>
</html>
